Causality-Aided Falsification

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Causality-Aided Falsification

Falsification is drawing attention in quality assurance of heterogeneous systems whose complexities are beyond most verification techniques’ scalability. In this paper we introduce the idea of causality aid in falsification: by providing a falsification solver—that relies on stochastic optimization of a certain cost function—with suitable causal information expressed by a Bayesian network, sear...

متن کامل

Induction-Guided Falsification

The induction-guided falsification searches a bounded reachable state space of a transition system for a counterexample that the system satisfies an invariant property. If no counterexamples are found, it tries to verify that the system satisfies the property by mathematical induction on the structure of the reachable state space of the system, from which some other invariant properties may be ...

متن کامل

Abstraction for Falsification

ion for Falsification Thomas Ball, Orna Kupferman, and Greta Yorsh 1 Microsoft Research, Redmond, WA, USA. Email: [email protected], URL: www.research.microsoft.com/∼tball 2 Hebrew University, School of Eng. and Comp. Sci., Jerusalem 91904, Israel. Email: [email protected], URL: www.cs.huji.ac.il/∼orna 3 Tel-Aviv University, School of Comp. Sci., Tel-Aviv 69978, Israel. Email:[email protected]...

متن کامل

Information, learning and falsification

There are (at least) three approaches to quantifying information. The first, algorithmic information or Kolmogorov complexity, takes events as strings and, given a universal Turing machine, quantifies the information content of a string as the length of the shortest program producing it [1]. The second, Shannon information, takes events as belonging to ensembles and quantifies the information r...

متن کامل

Falsification and Certainty

Falsification of a universal statement such as “all swans are white” requires verification of a particular statement such as “this swan is black.” Verification is an inductive process because it consists in examining one feature of the bird after another. The color of the feathers is not sufficient (the bird with black feathers could be a crow); many other features have to be compared. The iden...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2017

ISSN: 2075-2180

DOI: 10.4204/eptcs.257.2